Minimal Model Complexity Search
نویسنده
چکیده
SURFER is an empirical discovery system that given a set of input data and a modelling vocabulary returns the model that best describes that data. The best model is considered to be the one that minimizes the description length of that model plus the data encoded using that model. The search for models is controlled by the a priori estimate of model likelihoods as encoded in the modelling vocabulary. SURFER includes domain independent mechanisms for identifying redundant models and for nding free parameters. The system is described together with the results of running the system on several diierent types of problems.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملRereading the Bystrom and Jarvelin's Information Seeking Behavior Model: Can the Scope of this Model Be Criticized?
Background and aim: Information seeking behaviors are the reflection of users' needs that Identifying and understanding them correctly is imperative in information seeking endeavors. Experts have presented cognitive and Process user-oriented approach models to better understand scholars’ information seeking behaviors. The intent of models are to define and clarify the conditions that predict p...
متن کاملOn the Complexity of Computing Minimal Unsatisfiable LTL formulas
We show that (1) the Minimal False QCNF search-problem (MF-search) and the Minimal Unsatisfiable LTL formula search problem (MU-search) are FPSPACE complete because of the very expressive power of QBF/LTL, (2) we extend the PSPACE-hardness of the MF decision problem to the MU decision problem. As a consequence, we deduce a positive answer to the open question of PSPACE hardness of the inherent ...
متن کاملAn Efficient Projected Minimal Conflict Generator for Projected Prime Implicate and Implicant Generation
Performing real-time reasoning on models of physical systems is essential in many situations, especially when human intervention is impossible. Since many deductive reasoning tasks take memory or time that is exponential in the number of variables that appear in the model, efforts need to be made to reduce the size of the models used online. The model can be reduced without sacrificing reasonin...
متن کاملOPTIMAL WIND RESISTANT DESIGN OF TALL BUILDINGS UTILIZING MINE BLAST ALGORITHM
Practical design of tall frame-tube and diagrids are formulated as two discrete optimization problems searching for minimal weight undercodified constraints under gravitational and wind loading due to Iranian codes of practice for steel structures (Part 6 & Part 10). Particular encoding of design vector is proposed to efficiently handle both problems leading to minimal search space. Two types o...
متن کامل